Using the Breakout Algorithm to Identify Hard and Unsolvable Subproblems
نویسندگان
چکیده
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for highly constrained or overconstrained problems. In this paper, we present a scheme where a local search algorithm, the breakout algorithm, is used to identify hard or unsolvable subproblems and to derive a variable ordering that places the hardest subproblems first.
منابع مشابه
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unsolvability and is thus not suitable for tightly and overconstrained problems. We present a hybrid solving scheme where we combine a local search algorithm the breakout algorithm, with a systematic search algorithm backt...
متن کاملBoosting MUS Extraction
If a CSP instance has no solution, it contains a smaller unsolvable subproblem that makes unsolvable the whole problem. When solving such instance, instead of just returning the “no solution” message, it is of interest to return an unsolvable subproblem. The detection of such unsolvable subproblems has many applications: failure explanation, error diagnosis, planning, intelligent backtracking, ...
متن کاملGeneration of Hard Solvable Planning Problems
Existing models for sampling the space of all planning problems produce both solvable and unsolvable instances. In particular, when attempting to identify very hard ones, one encounters both, as the hardness in the standard models is accompanied by the possibility of an instance being solvable or unsolvable. This is a disadvantage of the standard models, because of the strong asymmetry of plann...
متن کاملText Summarization Using Cuckoo Search Optimization Algorithm
Today, with rapid growth of the World Wide Web and creation of Internet sites and online text resources, text summarization issue is highly attended by various researchers. Extractive-based text summarization is an important summarization method which is included of selecting the top representative sentences from the input document. When, we are facing into large data volume documents, the extr...
متن کاملOverview of complexity and decidability results for three classes of elementary nonlinear systems
It has become increasingly apparent this last decade that many problems in systems and control are NP-hard and, in some cases, undecidable. The inherent complexity of some of the most elementary problems in systems and control points to the necessity of using alternative approximate techniques to deal with problems that are unsolvable or intractable when exact solutions are sought. We survey so...
متن کامل